mat=[[0,0,0,0,0]]
for i in range(3):
mat.append([0]+list(map(int,input().split()))+[0])
mat.append([0,0,0,0,0])
eq=[]
for i in range(1,4):
eq_row=[]
for j in range(1,4):
eq_row+=[mat[i][j]+mat[i+1][j]+mat[i-1][j]+mat[i][j+1]+mat[i][j-1]]
eq.append(eq_row)
for i in range(3):
for j in range(3):
print((eq[i][j]+1)%2,end='')
print('')
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool func(int i,int j){
if((i>=0&&i<3)&&(j>=0&&j<3)){
return true;
}
else
return false;
}
int32_t main(){
int a[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin>>a[i][j];
}
}
int ans[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
ans[i][j] = 1;
}
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(a[i][j]%2==1){
ans[i][j]=ans[i][j]^1;
if(func(i,j+1)){ // adjacent possible or not
ans[i][j+1]=ans[i][j+1]^1;
}
if(func(i+1,j)){
ans[i+1][j]=ans[i+1][j]^1;
}
if(func(i-1,j)){
ans[i-1][j]=ans[i-1][j]^1;
}
if(func(i,j-1)){
ans[i][j-1]=ans[i][j-1]^1;
}
}
}
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cout<<ans[i][j];
}
cout<<endl;
}
return 0;
}151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |